On the Aizenman exponent in critical percolation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-arm Exponent for Critical 2d Percolation

The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than R is proved to decay like R−5/48 as R→ ∞.

متن کامل

A critical exponent for shortest-path scaling in continuum percolation

We carry out Monte Carlo experiments to study the scaling behavior of shortest path lengths in continuum percolation. These studies suggest that the critical exponent governing this scaling is the same for both continuum and lattice percolation. We use splitting, a technique that has not yet been fully exploited in the physics literature, to increase the speed of our simulations. This technique...

متن کامل

the effect of using critical discourse analytical tools on the improvement of the learners level of critical thinking in reading comprehension

?it is of utmost priority for an experienced teacher to train the mind of the students, and enable them to think critically and correctly. the most important question here is that how to develop such a crucial ability? this study examines a new way to the development of critical thinking utilizing critical discourse analytical tools. to attain this goal, two classes of senior english la...

Exact critical exponent for the shortest-path scaling function in percolation

It is shown that the critical exponent g1 related to pair-connectiveness and shortestpath (or chemical distance) scaling, recently studied by Porto et al., Dokholyan et al., and Grassberger, can be found exactly in 2d by using a crossing-probability result of Cardy, with the outcome g1 = 25/24. This prediction is consistent with existing simulation results. [Published as J. Phys. A. 32, L457-45...

متن کامل

On the critical probability in percolation

For percolation on finite transitive graphs, Nachmias and Peres suggested a characterization of the critical probability based on the logarithmic derivative of the susceptibility. As a first test-case, we study their suggestion for the Erdős–Rényi random graph Gn,p, and confirm that the logarithmic derivative has the desired properties: (i) its maximizer lies inside the critical window p = 1/n+...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Experimental and Theoretical Physics Letters

سال: 2002

ISSN: 0021-3640,1090-6487

DOI: 10.1134/1.1528706